An Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
نویسنده
چکیده
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
منابع مشابه
An Optimal Algorithm to Find Maximum and Minimum Height Spanning Trees on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find the maximum and the minimum height spanning trees on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملAn Optimal Algorithm to Find a Minimum 2-neighbourhood Covering Set on Cactus Graphs
Absttact. A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find minimum cardinality 2-neighbourhood-covering set on cactus graphs in) (n O time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملOn the Independent Set and Common Subgraph Problems in Random Graphs
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph G, each pair of vertices are joined by an edge with a probability p, where p is a constant between 0 and 1. We show that, a maximum independent set in a random graph that contains n vertices can be computed in expected computation time 2 2 2 . Using te...
متن کاملIndependence and Efficient Domination on P6-free Graph
In the Maximum Weight Independent Set problem, the input is a graph G, every vertex has a non-negative integer weight, and the task is to find a set S of pairwise non-adjacent vertices, maximizing the total weight of the vertices in S. We give an nO(log 2 n) time algorithm for this problem on graphs excluding the path P6 on 6 vertices as an induced subgraph. Currently, there is no constant k kn...
متن کامل2 Trapezoid Graphs
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. They propose an O(n 2) algorithm for chromatic number and a less eecient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, ...
متن کامل